Runtime Complexity (full) proof of /tmp/tmpt1hGHu/MYNAT_nokinds-noand

The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(2^n, INF).

0 CpxTRS

↳1 DecreasingLoopProof (⇔, 492 ms)

↳2 BOUNDS(2^n, INF)

↳3 RenamingProof (⇔, 0 ms)

↳4 CpxRelTRS

    ↳5 TypeInferenceProof (BOTH BOUNDS(ID, ID), 0 ms)

    ↳6 typed CpxTrs

    ↳7 OrderProof (LOWER BOUND(ID), 0 ms)

    ↳8 typed CpxTrs

    ↳9 RewriteLemmaProof (LOWER BOUND(ID), 533 ms)

    ↳10 BEST

        ↳11 typed CpxTrs

            ↳12 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)

            ↳13 typed CpxTrs

            ↳14 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)

            ↳15 typed CpxTrs

            ↳16 RewriteLemmaProof (LOWER BOUND(ID), 71 ms)

            ↳17 BEST

                ↳18 typed CpxTrs

                    ↳19 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)

                    ↳20 typed CpxTrs

                    ↳21 RewriteLemmaProof (LOWER BOUND(ID), 60 ms)

                    ↳22 BEST

                        ↳23 typed CpxTrs

                            ↳24 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)

                            ↳25 typed CpxTrs

                            ↳26 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)

                            ↳27 typed CpxTrs

                            ↳28 LowerBoundsProof (⇔, 0 ms)

                            ↳29 BOUNDS(n^2, INF)

                        ↳30 typed CpxTrs

                            ↳31 LowerBoundsProof (⇔, 0 ms)

                            ↳32 BOUNDS(n^2, INF)

                ↳33 typed CpxTrs

                    ↳34 LowerBoundsProof (⇔, 0 ms)

                    ↳35 BOUNDS(n^2, INF)

        ↳36 typed CpxTrs

            ↳37 LowerBoundsProof (⇔, 0 ms)

            ↳38 BOUNDS(n^1, INF)

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, V2) → U32(isNat(activate(V2)))
U32(tt) → tt
U41(tt, N) → activate(N)
U51(tt, M, N) → U52(isNat(activate(N)), activate(M), activate(N))
U52(tt, M, N) → s(plus(activate(N), activate(M)))
U61(tt) → 0
U71(tt, M, N) → U72(isNat(activate(N)), activate(M), activate(N))
U72(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
isNat(n__x(V1, V2)) → U31(isNat(activate(V1)), activate(V2))
plus(N, 0) → U41(isNat(N), N)
plus(N, s(M)) → U51(isNat(M), M, N)
x(N, 0) → U61(isNat(N))
x(N, s(M)) → U71(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
x(X1, X2) → n__x(X1, X2)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(n__x(X1, X2)) → x(activate(X1), activate(X2))
activate(X) → X

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(2ⁿ):
The rewrite sequence
activate(n__plus(X1, n__0)) →⁺ U41(isNat(activate(X1)), activate(X1))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0,0].
The pumping substitution is [X1 / n__plus(X1, n__0)].
The result substitution is [ ].

The rewrite sequence
activate(n__plus(X1, n__0)) →⁺ U41(isNat(activate(X1)), activate(X1))
gives rise to a decreasing loop by considering the right hand sides subterm at position [1].
The pumping substitution is [X1 / n__plus(X1, n__0)].
The result substitution is [ ].

(2) BOUNDS(2^n, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, V2) → U32(isNat(activate(V2)))
U32(tt) → tt
U41(tt, N) → activate(N)
U51(tt, M, N) → U52(isNat(activate(N)), activate(M), activate(N))
U52(tt, M, N) → s(plus(activate(N), activate(M)))
U61(tt) → 0'
U71(tt, M, N) → U72(isNat(activate(N)), activate(M), activate(N))
U72(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
isNat(n__x(V1, V2)) → U31(isNat(activate(V1)), activate(V2))
plus(N, 0') → U41(isNat(N), N)
plus(N, s(M)) → U51(isNat(M), M, N)
x(N, 0') → U61(isNat(N))
x(N, s(M)) → U71(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
x(X1, X2) → n__x(X1, X2)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(n__x(X1, X2)) → x(activate(X1), activate(X2))
activate(X) → X

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, V2) → U32(isNat(activate(V2)))
U32(tt) → tt
U41(tt, N) → activate(N)
U51(tt, M, N) → U52(isNat(activate(N)), activate(M), activate(N))
U52(tt, M, N) → s(plus(activate(N), activate(M)))
U61(tt) → 0'
U71(tt, M, N) → U72(isNat(activate(N)), activate(M), activate(N))
U72(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
isNat(n__x(V1, V2)) → U31(isNat(activate(V1)), activate(V2))
plus(N, 0') → U41(isNat(N), N)
plus(N, s(M)) → U51(isNat(M), M, N)
x(N, 0') → U61(isNat(N))
x(N, s(M)) → U71(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
x(X1, X2) → n__x(X1, X2)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(n__x(X1, X2)) → x(activate(X1), activate(X2))
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s:n__x → tt
tt :: tt
U12 :: tt → tt
isNat :: n__0:n__plus:n__s:n__x → tt
activate :: n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
U21 :: tt → tt
U31 :: tt → n__0:n__plus:n__s:n__x → tt
U32 :: tt → tt
U41 :: tt → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
U51 :: tt → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
U52 :: tt → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
s :: n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
plus :: n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
U61 :: tt → n__0:n__plus:n__s:n__x
0' :: n__0:n__plus:n__s:n__x
U71 :: tt → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
U72 :: tt → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
x :: n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
n__0 :: n__0:n__plus:n__s:n__x
n__plus :: n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
n__s :: n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
n__x :: n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x → n__0:n__plus:n__s:n__x
hole_tt1_3 :: tt
hole_n__0:n__plus:n__s:n__x2_3 :: n__0:n__plus:n__s:n__x
gen_n__0:n__plus:n__s:n__x3_3 :: Nat → n__0:n__plus:n__s:n__x

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
isNat, activate, U41, plus, x

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(8) Obligation:

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
activate, isNat, U41, plus, x

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)) → gen_n__0:n__plus:n__s:n__x3_3(n5_3), rt ∈ Ω(1 + n5₃)

Induction Base:
activate(gen_n__0:n__plus:n__s:n__x3_3(0)) →_R^Ω(1)
gen_n__0:n__plus:n__s:n__x3_3(0)

Induction Step:
activate(gen_n__0:n__plus:n__s:n__x3_3(+(n5_3, 1))) →_R^Ω(1)
plus(activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)), activate(n__0)) →_IH
plus(gen_n__0:n__plus:n__s:n__x3_3(c6_3), activate(n__0)) →_R^Ω(1)
plus(gen_n__0:n__plus:n__s:n__x3_3(n5_3), n__0) →_R^Ω(1)
n__plus(gen_n__0:n__plus:n__s:n__x3_3(n5_3), n__0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

Lemmas:
activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)) → gen_n__0:n__plus:n__s:n__x3_3(n5_3), rt ∈ Ω(1 + n5₃)

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
plus, isNat, U41, x

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol plus.

(13) Obligation:

Lemmas:
activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)) → gen_n__0:n__plus:n__s:n__x3_3(n5_3), rt ∈ Ω(1 + n5₃)

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
U41, isNat, x

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(14) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol U41.

(15) Obligation:

Lemmas:
activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)) → gen_n__0:n__plus:n__s:n__x3_3(n5_3), rt ∈ Ω(1 + n5₃)

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
isNat, x

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(16) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
isNat(gen_n__0:n__plus:n__s:n__x3_3(n4321_3)) → tt, rt ∈ Ω(1 + n4321₃ + n4321₃²)

Induction Base:
isNat(gen_n__0:n__plus:n__s:n__x3_3(0)) →_R^Ω(1)
tt

Induction Step:
isNat(gen_n__0:n__plus:n__s:n__x3_3(+(n4321_3, 1))) →_R^Ω(1)
U11(isNat(activate(gen_n__0:n__plus:n__s:n__x3_3(n4321_3))), activate(n__0)) →_L^{Ω(1 + n4321₃)}
U11(isNat(gen_n__0:n__plus:n__s:n__x3_3(n4321_3)), activate(n__0)) →_IH
U11(tt, activate(n__0)) →_L^Ω(1)
U11(tt, gen_n__0:n__plus:n__s:n__x3_3(0)) →_R^Ω(1)
U12(isNat(activate(gen_n__0:n__plus:n__s:n__x3_3(0)))) →_L^Ω(1)
U12(isNat(gen_n__0:n__plus:n__s:n__x3_3(0))) →_R^Ω(1)
U12(tt) →_R^Ω(1)
tt

We have rt ∈ Ω(n²) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n²).

(17) Complex Obligation (BEST)

(18) Obligation:

Lemmas:
activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)) → gen_n__0:n__plus:n__s:n__x3_3(n5_3), rt ∈ Ω(1 + n5₃)
isNat(gen_n__0:n__plus:n__s:n__x3_3(n4321_3)) → tt, rt ∈ Ω(1 + n4321₃ + n4321₃²)

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
x, activate, U41, plus

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol x.

(20) Obligation:

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
activate, U41, plus

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(21) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
activate(gen_n__0:n__plus:n__s:n__x3_3(n6714_3)) → gen_n__0:n__plus:n__s:n__x3_3(n6714_3), rt ∈ Ω(1 + n6714₃)

Induction Base:
activate(gen_n__0:n__plus:n__s:n__x3_3(0)) →_R^Ω(1)
gen_n__0:n__plus:n__s:n__x3_3(0)

Induction Step:
activate(gen_n__0:n__plus:n__s:n__x3_3(+(n6714_3, 1))) →_R^Ω(1)
plus(activate(gen_n__0:n__plus:n__s:n__x3_3(n6714_3)), activate(n__0)) →_IH
plus(gen_n__0:n__plus:n__s:n__x3_3(c6715_3), activate(n__0)) →_R^Ω(1)
plus(gen_n__0:n__plus:n__s:n__x3_3(n6714_3), n__0) →_R^Ω(1)
n__plus(gen_n__0:n__plus:n__s:n__x3_3(n6714_3), n__0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(22) Complex Obligation (BEST)

(23) Obligation:

Lemmas:
activate(gen_n__0:n__plus:n__s:n__x3_3(n6714_3)) → gen_n__0:n__plus:n__s:n__x3_3(n6714_3), rt ∈ Ω(1 + n6714₃)
isNat(gen_n__0:n__plus:n__s:n__x3_3(n4321_3)) → tt, rt ∈ Ω(1 + n4321₃ + n4321₃²)

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
plus, U41

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(24) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol plus.

(25) Obligation:

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

The following defined symbols remain to be analysed:
U41

They will be analysed ascendingly in the following order:
isNat = activate
isNat = U41
isNat = plus
isNat = x
activate = U41
activate = plus
activate = x
U41 = plus
U41 = x
plus = x

(26) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol U41.

(27) Obligation:

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

No more defined symbols left to analyse.

(28) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
isNat(gen_n__0:n__plus:n__s:n__x3_3(n4321_3)) → tt, rt ∈ Ω(1 + n4321₃ + n4321₃²)

(29) BOUNDS(n^2, INF)

(30) Obligation:

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

No more defined symbols left to analyse.

(31) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
isNat(gen_n__0:n__plus:n__s:n__x3_3(n4321_3)) → tt, rt ∈ Ω(1 + n4321₃ + n4321₃²)

(32) BOUNDS(n^2, INF)

(33) Obligation:

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

No more defined symbols left to analyse.

(34) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
isNat(gen_n__0:n__plus:n__s:n__x3_3(n4321_3)) → tt, rt ∈ Ω(1 + n4321₃ + n4321₃²)

(35) BOUNDS(n^2, INF)

(36) Obligation:

Lemmas:
activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)) → gen_n__0:n__plus:n__s:n__x3_3(n5_3), rt ∈ Ω(1 + n5₃)

Generator Equations:
gen_n__0:n__plus:n__s:n__x3_3(0) ⇔ n__0
gen_n__0:n__plus:n__s:n__x3_3(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s:n__x3_3(x), n__0)

No more defined symbols left to analyse.

(37) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
activate(gen_n__0:n__plus:n__s:n__x3_3(n5_3)) → gen_n__0:n__plus:n__s:n__x3_3(n5_3), rt ∈ Ω(1 + n5₃)

(0) Obligation:

(1) DecreasingLoopProof (EQUIVALENT transformation)

(2) BOUNDS(2^n, INF)

(3) RenamingProof (EQUIVALENT transformation)

(4) Obligation:

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

(6) Obligation:

(7) OrderProof (LOWER BOUND(ID) transformation)

(8) Obligation:

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

(10) Complex Obligation (BEST)

(11) Obligation:

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

(13) Obligation:

(14) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

(15) Obligation:

(16) RewriteLemmaProof (LOWER BOUND(ID) transformation)

(17) Complex Obligation (BEST)

(18) Obligation:

(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

(20) Obligation:

(21) RewriteLemmaProof (LOWER BOUND(ID) transformation)

(22) Complex Obligation (BEST)

(23) Obligation:

(24) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

(25) Obligation:

(26) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

(27) Obligation:

(28) LowerBoundsProof (EQUIVALENT transformation)

(29) BOUNDS(n^2, INF)

(30) Obligation:

(31) LowerBoundsProof (EQUIVALENT transformation)

(32) BOUNDS(n^2, INF)

(33) Obligation:

(34) LowerBoundsProof (EQUIVALENT transformation)

(35) BOUNDS(n^2, INF)

(36) Obligation:

(37) LowerBoundsProof (EQUIVALENT transformation)

(38) BOUNDS(n^1, INF)